perm filename GR.1[QLA,LSP] blob
sn#757074 filedate 1984-05-29 generic text, type C, neo UTF8
COMMENT ⊗ VALID 00003 PAGES
C REC PAGE DESCRIPTION
C00001 00001
C00002 00002 (fasload graph)
C00006 00003
C00011 ENDMK
C⊗;
(fasload graph)
(*rset (nouuo t))
;;; Start acronym for GGRAPH
(fasload ggraph)
(filjob-g ↓figure.5[1,rpg])
(kiljob-g)
;;; Then XGPJOB
(defun gr1 ()
(do ((x (read) (read))
(n 1 (1+ n))
(p1 ()))
((eq x t)
(and (boundp '*chan*)(m-uninit))
(setq p1 (reverse p1))
(break before t)
(m-init-graph p1)
(m-reference p1)
*chan*)
(push (list n x) p1)))
(defun gr2 ()
(do ((x (read) (read))
(n 1 (1+ n))
(p1 ()) (p2 ()))
((eq x t)
(and (boundp '*chan*)(m-uninit))
(setq p1 (reverse p1))
(setq p2 (reverse p2))
(break before t)
(m-init-graph p1)
(break p1 t)
(m-add-graph p2)
(break p2 t)
(m-reference p1)
*chan*)
(push (list n x) p1)
(push (list n (read)) p2)))
(defun gr4 ()
(do ((x (read) (read))
(n 1 (1+ n))
(p1 ()) (p2 ()) (p3 ()) (p4 ()))
((eq x t)
(and (boundp '*chan*)(m-uninit))
(setq p1 (reverse p1))
(setq p2 (reverse p2))
(setq p3 (reverse p3))
(setq p4 (reverse p4))
(break before t)
(m-init-graph p3)
(m-add-graph p2)
(m-add-graph p1)
(m-add-graph p4)
(m-reference p3)
*chan*)
(push (list n x) p1)
(push (list n (read)) p2)
(push (list n (read)) p3)
(push (list n (read)) p4)))
(defun gr5 ()
(do ((x (read) (read))
(n 1 (1+ n))
(p1 ()) (p2 ()) (p3 ()) (p4 ())(p5 ()))
((eq x t)
(and (boundp '*chan*)(m-uninit))
(setq p1 (reverse p1))
(setq p2 (reverse p2))
(setq p3 (reverse p3))
(setq p4 (reverse p4))
(setq p5 (reverse p5))
(break before t)
(m-init-graph p2)
(m-add-graph p3)
; (m-add-graph p2)
(m-add-graph p1)
(m-add-graph p5)
(m-reference p2)
*chan*)
(push (list n x) p1)
(push (list n (read)) p2)
(push (list n (read)) p3)
(push (list n (read)) p4)
(push (list n (read)) p5)))
(defun ggr1 ()
(do ((x (read) (read))
(n 1 (1+ n))
(p1 ()))
((eq x t)
(and (boundp '*chan*)(m-uninit))
(setq p1 (reverse p1))
(break before t)
(m-init-ggraph p1)
(m-greference p1)
*chan*)
(push (list n x) p1)))
(defun ggr2 ()
(do ((x (read) (read))
(n 1 (1+ n))
(p1 ()) (p2 ()))
((eq x t)
(and (boundp '*chan*)(m-uninit))
(setq p1 (reverse p1))
(setq p2 (reverse p2))
(break before t)
(m-init-ggraph p1)
(break p1 t)
(m-add-ggraph p2)
(break p2 t)
(m-greference p1)
*chan*)
(push (list n x) p1)
(push (list n (read)) p2)))
(defun ggr3 ()
(do ((x (read) (read))
(n 1 (1+ n))
(p1 ()) (p2 ()) (p3 ()))
((eq x t)
(and (boundp '*chan*)(m-uninit))
(setq p1 (reverse p1))
(setq p2 (reverse p2))
(setq p3 (reverse p3))
(break before t)
(m-init-ggraph p1)
(m-add-ggraph p2)
(m-add-ggraph p1)
(m-greference p2)
*chan*)
(push (list n x) p1)
(push (list n (read)) p2)
(push (list n (read)) p3)))
(defun ggr4 ()
(do ((x (read) (read))
(n 1 (1+ n))
(p1 ()) (p2 ()) (p3 ()) (p4 ()))
((eq x t)
(and (boundp '*chan*)(m-uninit))
(setq p1 (reverse p1))
(setq p2 (reverse p2))
(setq p3 (reverse p3))
(setq p4 (reverse p4))
(break before t)
(m-init-ggraph p1)
(m-add-ggraph p2)
(m-add-ggraph p3)
(m-add-ggraph p4)
(m-greference p1)
*chan*)
(push (list n x) p1)
(push (list n (read)) p2)
(push (list n (read)) p3)
(push (list n (read)) p4)))
(defun ggr5 ()
(do ((x (read) (read))
(n 1 (1+ n))
(p1 ()) (p2 ()) (p3 ()) (p4 ()) (p5 ()))
((eq x t)
(and (boundp '*chan*)(m-uninit))
(setq p1 (reverse p1))
(setq p2 (reverse p2))
(setq p3 (reverse p3))
(setq p4 (reverse p4))
(setq p5 (reverse p5))
(break before t)
(m-init-ggraph p1)
(m-add-ggraph p2)
(m-add-ggraph p3)
(m-add-ggraph p4)
(m-add-ggraph p5)
(m-greference p3)
*chan*)
(push (list n x) p1)
(push (list n (read)) p2)
(push (list n (read)) p3)
(push (list n (read)) p4)
(push (list n (read)) p5)))